Boolean satisfiability problem

Results: 324



#Item
311Complexity classes / Mathematical optimization / NP-complete problems / Logical truth / Boolean algebra / P versus NP problem / Boolean satisfiability problem / NP-complete / NP / Theoretical computer science / Computational complexity theory / Applied mathematics

PDF Document

Add to Reading List

Source URL: www.ams.org

Language: English - Date: 2010-01-14 13:30:09
312Complexity classes / Decision problem / P versus NP problem / NP-complete / NP / Polynomial / Boolean satisfiability problem / Time complexity / 2-satisfiability / Theoretical computer science / Computational complexity theory / Applied mathematics

PDF Document

Add to Reading List

Source URL: stationq.cnsi.ucsb.edu

Language: English - Date: 2008-02-01 12:23:22
313Electronic design automation / Formal methods / Logic in computer science / NP-complete problems / Boolean algebra / Boolean satisfiability problem / Satisfiability Modulo Theories / True quantified Boolean formula / Solver / Theoretical computer science / Applied mathematics / Mathematics

PDF Document

Add to Reading List

Source URL: staff.science.uva.nl

Language: English - Date: 2006-11-16 10:32:03
314NP-complete problems / Boolean algebra / Hamiltonian path / Gray code / Boolean satisfiability problem / Conjunctive normal form / Induced path / Propositional formula / Cube / Mathematics / Theoretical computer science / Graph theory

PDF Document

Add to Reading List

Source URL: jsat.ewi.tudelft.nl

Language: English - Date: 2008-05-07 17:14:15
315Complexity classes / NP-complete / P versus NP problem / NP / Boolean satisfiability problem / Natural proof / Interactive proof system / Reduction / P / Theoretical computer science / Computational complexity theory / Applied mathematics

PDF Document

Add to Reading List

Source URL: people.cs.uchicago.edu

Language: English - Date: 2010-05-13 09:39:04
316Boolean algebra / Conjunctive normal form / Disjunctive normal form / Implicant / Decision list / IP / FO / Time complexity / Boolean satisfiability problem / Theoretical computer science / Computational complexity theory / Mathematics

PDF Document

Add to Reading List

Source URL: people.csail.mit.edu

Language: English - Date: 2013-06-02 16:27:23
317NP-complete problems / Logic in computer science / Boolean algebra / Analysis of algorithms / Exponential time hypothesis / 2-satisfiability / Conjunctive normal form / Boolean satisfiability problem / Clique problem / Theoretical computer science / Computational complexity theory / Applied mathematics

PDF Document

Add to Reading List

Source URL: people.csail.mit.edu

Language: English - Date: 2009-10-12 16:16:00
318Complexity classes / NP-complete problems / Mathematical optimization / NP-complete / Boolean satisfiability problem / 2-satisfiability / NP / P versus NP problem / Vertex cover / Theoretical computer science / Computational complexity theory / Applied mathematics

PDF Document

Add to Reading List

Source URL: people.clarkson.edu

Language: English - Date: 2010-01-28 15:52:09
319Electronic design automation / Formal methods / Logic in computer science / NP-complete problems / Boolean algebra / Boolean satisfiability problem / Satisfiability Modulo Theories / Solver / True quantified Boolean formula / Theoretical computer science / Applied mathematics / Mathematics

PDF Document

Add to Reading List

Source URL: pst.istc.cnr.it

Language: English - Date: 2007-08-26 10:17:21
320NP-complete problems / Boolean algebra / Boolean satisfiability problem / Electronic design automation / Logic in computer science / 2-satisfiability / Conjunctive normal form / PP / MAX-3SAT / Theoretical computer science / Computational complexity theory / Applied mathematics

PDF Document

Add to Reading List

Source URL: research.microsoft.com

Language: English - Date: 2002-04-24 17:27:28
UPDATE